Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs
نویسندگان
چکیده
منابع مشابه
Stable Zero Duality Gaps in Convex Programming: Complete Dual Characterisations with Applications to Semidefinite Programs∗
The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite dimensional prob...
متن کاملContinuous Convex Sets and Zero Duality Gap for Convex Programs
This article uses classical notions of convex analysis over euclidean spaces, like Gale & Klee’s boundary rays and asymptotes of a convex set, or the inner aperture directions defined by Larman and Brøndsted for the same class of sets, to provide a new zero duality gap criterion for ordinary convex programs. On this ground, we are able to characterize objective functions and respectively feasib...
متن کاملOn duality theory for non-convex semidefinite programming
In this paper, with the help of convex-like function, we discuss the duality theory for nonconvex semidefinite programming. Our contributions are: duality theory for the general nonconvex semidefinite programming when Slater’s condition holds; perfect duality for a special case of the nonconvex semidefinite programming for which Slater’s condition fails. We point out that the results of [2] can...
متن کاملConditions for zero duality gap in convex programming
We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex optimization. We prove that our condition is weaker than all existing constraint qualifications, including the closed epigraph condition. Our dual condition was inspired by, and is weaker than, the so-called Bertsekas’ condition for monotropic programming problems. We give several corollaries of...
متن کاملComplete Dual Characterizations of Optimality and Feasibility for Convex Semidefinite Programming
A convex semidefinite programming problem is a convex constrained optimization problem, where the constraints are linear matrix inequalities, for which the standard Lagrangian condition is sufficient for optimality. However, this condition requires constraint qualifications to completely characterize optimality. We present a necessary and sufficient condition for optimality without a constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2009
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2009.06.043